few heuristic optimization algorithms to solve the multi-period fixed charge production-distribution problem
نویسندگان
چکیده
this paper deals with a multi-period fixed charge production-distribution problem associated with backorder and inventories. the objective is to determine the size of the shipments from each supplier and backorder and inventories at each period, so that the total cost incurred during the entire period towards production, transportation, backorder and inventories is minimised. a 0-1 mixed integer programming problem is formulated. genetic algorithm based population search heuristic, simulated annealing based neighbourhood search heuristic and equivalent variable cost based simple heuristic are proposed to solve the formulation. the proposed methodologies are evaluated by comparing their solutions with the lower bound solutions. the comparisons reveal that genetic algorithm and simulated annealing algorithm generate better solutions than the equivalent variable cost solutions and are capable of providing solutions close to the lower bound value of the problems.
منابع مشابه
Few heuristic optimization algorithms to solve the multi-period fixed charge production-distribution problem
This paper deals with a multi-period fixed charge production-distribution problem associated with backorder and inventories. The objective is to determine the size of the shipments from each supplier and backorder and inventories at each period, so that the total cost incurred during the entire period towards production, transportation, backorder and inventories is minimised. A 0-1 mixed intege...
متن کاملFew heuristic optimization algorithms to solve the multi-period fixed charge production-distribution problem
متن کامل
Meta-heuristic Algorithms for an Integrated Production-Distribution Planning Problem in a Multi-Objective Supply Chain
In today's globalization, an effective integration of production and distribution plans into a unified framework is crucial for attaining competitive advantage. This paper addresses an integrated multi-product and multi-time period production/distribution planning problem for a two-echelon supply chain subject to the real-world variables and constraints. It is assumed that all transportations a...
متن کاملElectromagnetism-like Algorithms for The Fuzzy Fixed Charge Transportation Problem
In this paper, we consider the fuzzy fixed-charge transportation problem (FFCTP). Both of fixed and transportation cost are fuzzy numbers. Contrary to previous works, Electromagnetism-like Algorithms (EM) is firstly proposed in this research area to solve the problem. Three types of EM; original EM, revised EM, and hybrid EM are firstly employed for the given problem. The latter is being firstl...
متن کاملSolving the Fixed Charge Transportation Problem by New Heuristic Approach
The fixed charge transportation problem (FCTP) is a deployment of the classical transportation problem in which a fixed cost is incurred, independent of the amount transported, along with a variable cost that is proportional to the amount shipped. Since the problem is considered as an NP-hard, the computational time grows exponentially as the size of the problem increases. In this pape...
متن کاملHeuristic Algorithms for the Fixed-Charge Multiple Knapsack Problem
In a previous paper we formulated the fixed-charge multiple knapsack problem (FCMKP), and developed an exact algorithm to solve this problem to optimality by combining pegging test and branch-and-bound technique. Although the developed algorithm was quite successful for instances with small number of knapsacks (m), for larger m the problem was hard to solve by this method. Here we present some ...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
journal of computational & applied research in mechanical engineering (jcarme)ناشر: shahid rajaee teacher training university (srttu)
ISSN 2228-7922
دوره 1
شماره 2 2012
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023